Remarks on Adult Languages of Propagating Systems with Restricted Parallelism
نویسنده
چکیده
abstract Various rewriting mechanisms can be thought of as functions mapping words w to nite sets of words W. The adult language of (; !) is the set of words w which are xed points of , i.e. (w) = fwg, and reachable from a start word or axiom !, i.e. w 2 n (!) for some n 2 N 0. Interestingly, for systems without the table mechanism, the degree of parallelism does not aaect the generative capacity when considering adult languages. On the other hand, considering systems with tables, the families of adult languages equal the corresponding families of languages with extensions. Furthermore, some open problems from 2,7,27 are attacked by using propagating ordered grammars. The proofs of the results mentioned in this paper appear elsewhere. 8
منابع مشابه
Remarks on Propagating Partition-limited Et0l Systems
In this paper, we sharpen the results of GG artner on the universality of partition-limited ET0L systems by showing that such deterministic systems characterize the recursively enumerable sets, and, furthermore, the propagating deterministic partition-limited ET0L systems characterize the programmed languages with appearance checking disallowing erasing productions. The main results of this pap...
متن کاملRemarks on Propagating Partition-Limited ETOL Systems
In this paper, we sharpen the results of G artner on the universality of partition-limited ET0L systems by showing that such deterministic systems characterize the recursively enumerable sets, and, furthermore, the propagating deterministic partition-limited ET0L systems characterize the programmed languages with appearance checking disallowing erasing productions. The main results of this pap...
متن کاملA Comparative Study in Relation to the Translation of the Linguistic Humor
Mark Twain made use of repetition and parallelism as two comedic literary devices to bring comic effect to the readers. Linguistic devices of humor, repetition and parallelism seemed to create many difficulties in the translation of literary texts. The present study applied Delabatista‟s strategies for translating wordplays such as repetition and parallelism in the translation of humorous texts...
متن کاملIn Ipps'93: International Parallel Processing Symposium Explicit Parallel Structuring for Rule-based Programming
This paper presents semantically-based explicit parallel structuring for rule-based programming systems. Explicit parallel structuring appears to be necessary since compile-time dependency analysis of sequential programs has not yielded large scale parallelism and run-time analysis for parallelism is restricted by the execution cost of the analysis. Simple language extensions specifying semanti...
متن کاملRemarks on Regulated Limited ET0L Systems and Regulated Context-Free Grammars
We continue the studies of the second author on regulated uniformly k-limited and regulated k-limited ET0L systems. We focus on the permitting and forbidding random context regulation. Especially, we establish some results on (regulated) propagating (uniformly) k-limited ET0L systems which were not solved in 2, 18, 21, 22]. Moreover, relations to recurrent programmed languages introduced by von...
متن کامل